I/O scheduling system and method

ABSTRACT

A method, computer program product, and computing system for associating a first I/O scheduling queue with a first process accessing a storage network. The first I/O scheduling queue is configured to receive a plurality of first process I/O requests. A second I/O scheduling queue is associated with a second process accessing the storage network. The second I/O scheduling queue is configured to receive a plurality of second process I/O requests.

RELATED APPLICATIONS

The subject application is a continuation application of U.S. patentapplication Ser. No. 13/077,863, filed on Mar. 31, 2011, the entirecontent of which is herein incorporated by reference.

TECHNICAL FIELD

This disclosure relates to I/O systems and, more particularly, to I/Oscheduling systems.

BACKGROUND

Operating system I/O schedulers attempt to order and merge I/O requeststo increase the overall I/O throughput across a set of devices from aset of concurrent processes. One aspect of some of these schedulers isto introduce a delay to a device in anticipation of additional I/Os thatcan be ordered and/or merged with previous I/Os. This is especiallyhelpful, in theory, four subsequent workloads were mergable candidatesare abundant.

The drawback to this approach is that the delay is typically time-basedand does not take into consideration the current load that is alreadyenqueued in the device. Also, in high-process count environments, singledevice queue algorithms lose potential candidates as the I/Os are spreadto far apart.

SUMMARY OF DISCLOSURE

In a first implementation, a method includes associating a first I/Oscheduling queue with a first process accessing a storage network. Thefirst I/O scheduling queue is configured to receive a plurality of firstprocess I/O requests. A second I/O scheduling queue is associated with asecond process accessing the storage network. The second I/O schedulingqueue is configured to receive a plurality of second process I/Orequests.

One or more of the following features may be included. First statusinformation concerning the first I/O scheduling queue may be received.The rate at which the first I/O scheduling queue provides the firstprocess I/O requests to the storage network may be regulated. Secondstatus information concerning the second I/O scheduling queue may bereceived. The rate at which the second I/O scheduling queue provides thesecond process I/O requests to the storage network may be regulated. Twoor more of the first process I/O requests may be combined to form acombined first process I/O request. Two or more of the second processI/O requests may be combined to form a combined second process I/Orequest.

In another implementation, a computer program product resides on acomputer readable medium and has a plurality of instructions stored onit. When executed by a processor, the instructions cause the processorto perform operations including associating a first I/O scheduling queuewith a first process accessing a storage network. The first I/Oscheduling queue is configured to receive a plurality of first processI/O requests. A second I/O scheduling queue is associated with a secondprocess accessing the storage network. The second I/O scheduling queueis configured to receive a plurality of second process I/O requests.

One or more of the following features may be included. First statusinformation concerning the first I/O scheduling queue may be received.The rate at which the first I/O scheduling queue provides the firstprocess I/O requests to the storage network may be regulated. Secondstatus information concerning the second I/O scheduling queue may bereceived. The rate at which the second I/O scheduling queue provides thesecond process I/O requests to the storage network may be regulated. Twoor more of the first process I/O requests may be combined to form acombined first process I/O request. Two or more of the second processI/O requests may be combined to form a combined second process I/Orequest.

In another implementation, a computing system includes at least oneprocessor and at least one memory architecture coupled with the at leastone processor.

A first software module is executed on the at least one processor andthe at least one memory architecture. The first software module isconfigured to perform operations including associating a first I/Oscheduling queue with a first process accessing a storage network. Thefirst I/O scheduling queue is configured to receive a plurality of firstprocess I/O requests.

A second software module is executed on the at least one processor andthe at least one memory architecture. The second software module isconfigured to perform operations including associating a second I/Oscheduling queue with a second process accessing the storage network.The second I/O scheduling queue is configured to receive a plurality ofsecond process I/O requests.

One or more of the following features may be included. First statusinformation concerning the first I/O scheduling queue may be received.The rate at which the first I/O scheduling queue provides the firstprocess I/O requests to the storage network may be regulated. Secondstatus information concerning the second I/O scheduling queue may bereceived. The rate at which the second I/O scheduling queue provides thesecond process I/O requests to the storage network may be regulated. Twoor more of the first process I/O requests may be combined to form acombined first process I/O request. Two or more of the second processI/O requests may be combined to form a combined second process I/Orequest.

The details of one or more implementations are set forth in theaccompanying drawings and the description below. Other features andadvantages will become apparent from the description, the drawings, andthe claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagrammatic view of a storage network and a I/O schedulingprocess coupled to a distributed computing network;

FIG. 2 is a diagrammatic view of the storage network of FIG. 1;

FIG. 3 is a flowchart of the I/O scheduling process of FIG. 1; and

FIG. 4 is a diagrammatic view of scheduling queues controlled by the I/Oscheduling process of FIG. 1.

Like reference symbols in the various drawings indicate like elements.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

System Overview:

As will be appreciated by one skilled in the art, the present disclosuremay be embodied as a method, system, or computer program product.Accordingly, the present disclosure may take the form of an entirelyhardware embodiment, an entirely software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system.” Furthermore,the present disclosure may take the form of a computer program producton a computer-usable storage medium having computer-usable program codeembodied in the medium.

Any suitable computer usable or computer readable medium may beutilized. The computer-usable or computer-readable medium may be, forexample but not limited to, an electronic, magnetic, optical,electromagnetic, infrared, or semiconductor system, apparatus, device,or propagation medium. More specific examples (a non-exhaustive list) ofthe computer-readable medium would include the following: an electricalconnection having one or more wires, a portable computer diskette, ahard disk, a random access memory (RAM), a read-only memory (ROM), anerasable programmable read-only memory (EPROM or Flash memory), anoptical fiber, a portable compact disc read-only memory (CD-ROM), anoptical storage device, a transmission media such as those supportingthe Internet or an intranet, or a magnetic storage device. Note that thecomputer-usable or computer-readable medium could even be paper oranother suitable medium upon which the program is printed, as theprogram can be electronically captured, via, for instance, opticalscanning of the paper or other medium, then compiled, interpreted, orotherwise processed in a suitable manner, if necessary, and then storedin a computer memory. In the context of this document, a computer-usableor computer-readable medium may be any medium that can contain, store,communicate, propagate, or transport the program for use by or inconnection with the instruction execution system, apparatus, or device.The computer-usable medium may include a propagated data signal with thecomputer-usable program code embodied therewith, either in baseband oras part of a carrier wave. The computer usable program code may betransmitted using any appropriate medium, including but not limited tothe Internet, wireline, optical fiber cable, RF, etc.

Computer program code for carrying out operations of the presentdisclosure may be written in an object oriented programming languagesuch as Java, Smalltalk, C++ or the like. However, the computer programcode for carrying out operations of the present disclosure may also bewritten in conventional procedural programming languages, such as the“C” programming language or similar programming languages. The programcode may execute entirely on the user's computer, partly on the user'scomputer, as a stand-alone software package, partly on the user'scomputer and partly on a remote computer or entirely on the remotecomputer or server. In the latter scenario, the remote computer may beconnected to the user's computer through a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

The present disclosure is described below with reference to flowchartillustrations and/or block diagrams of methods, apparatus (systems) andcomputer program products according to embodiments of the disclosure. Itwill be understood that each block of the flowchart illustrations and/orblock diagrams, and combinations of blocks in the flowchartillustrations and/or block diagrams, can be implemented by computerprogram instructions. These computer program instructions may beprovided to a processor of a general purpose computer, special purposecomputer, or other programmable data processing apparatus to produce amachine, such that the instructions, which execute via the processor ofthe computer or other programmable data processing apparatus, createmeans for implementing the functions/acts specified in the flowchartand/or block diagram block or blocks.

These computer program instructions may also be stored in acomputer-readable memory that can direct a computer or otherprogrammable data processing apparatus to function in a particularmanner, such that the instructions stored in the computer-readablememory produce an article of manufacture including instruction meanswhich implement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer orother programmable data processing apparatus to cause a series ofoperational steps to be performed on the computer or other programmableapparatus to produce a computer implemented process such that theinstructions which execute on the computer or other programmableapparatus provide steps for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

Referring to FIG. 1, there is shown I/O scheduling process 10 that mayreside on and may be executed by storage network 12, which may beconnected to network 14 (e.g., the Internet or a local area network).Examples of storage network 12 may include, but are not limited to: aNetwork Attached Storage (NAS) system and a Storage Area Network (SAN).As will be discussed below in greater detail, a SAN may include one ormore of a personal computer, a server computer, a series of servercomputers, a mini computer, a mainframe computer, a RAID array and anNAS. The various components of storage network 12 may execute one ormore operating systems, examples of which may include but are notlimited to: Microsoft Windows XP Server™; Novell Netware™; RedhatLinux™, Unix, or a custom operating system, for example.

As will be discussed below in greater detail, I/O scheduling process 10may associate a first I/O scheduling queue with a first processaccessing storage network 12. The first I/O scheduling queue may beconfigured to receive a plurality of first process I/O requests. I/Oscheduling process 10 may associate a second I/O scheduling queue with asecond process accessing the storage network. The second I/O schedulingqueue may be configured to receive a plurality of second process I/Orequests.

The instruction sets and subroutines of I/O scheduling process 10, whichmay be stored on storage device 16 included within storage network 12,may be executed by one or more processors (not shown) and one or morememory architectures (not shown) included within storage network 12.Storage device 16 may include but is not limited to: a hard disk drive;a tape drive; an optical drive; a RAID array; a random access memory(RAM); a read-only memory (ROM); and flash memory.

Network 14 may be connected to one or more secondary networks (e.g.,network 18), examples of which may include but are not limited to: alocal area network; a wide area network; or an intranet, for example.

Various data requests (e.g. data request 20) may be sent from clientapplications 22, 24, 26, 28 to storage network 12. Examples of datarequest 20 may include but are not limited to data write requests (i.e.a request that a data segment be written to storage network 12) and dataread requests (i.e. a request that a data segment be read from storagenetwork 12).

The instruction sets and subroutines of client applications 22, 24, 26,28, which may be stored on storage devices 30, 32, 34, 36 (respectively)coupled to client electronic devices 38, 40, 42, 44 (respectively), maybe executed by one or more processors (not shown) and one or more memoryarchitectures (not shown) incorporated into client electronic devices38, 40, 42, 44 (respectively). Storage devices 30, 32, 34, 36 mayinclude but are not limited to: hard disk drives; tape drives; opticaldrives; RAID arrays; random access memories (RAM); read-only memories(ROM), and all forms of flash memory storage devices. Examples of clientelectronic devices 38, 40, 42, 44 may include, but are not limited to,personal computer 38, laptop computer 40, personal digital assistant 42,notebook computer 44, a server (not shown), a data-enabled, cellulartelephone (not shown), and a dedicated network device (not shown).

Users 46, 48, 50, 52 may access storage network 12 directly throughnetwork 14 or through secondary network 18. Further, storage network 12may be connected to network 14 through secondary network 18, asillustrated with phantom link line 54.

The various client electronic devices may be directly or indirectlycoupled to network 14 (or network 18). For example, personal computer 38is shown directly coupled to network 14 via a hardwired networkconnection. Further, notebook computer 44 is shown directly coupled tonetwork 18 via a hardwired network connection. Laptop computer 40 isshown wirelessly coupled to network 14 via wireless communicationchannel 56 established between laptop computer 40 and wireless accesspoint (i.e., WAP) 58, which is shown directly coupled to network 14. WAP58 may be, for example, an IEEE 802.11a, 802.11b, 802.11g, Wi-Fi, and/orBluetooth device that is capable of establishing wireless communicationchannel 56 between laptop computer 40 and WAP 58. Personal digitalassistant 42 is shown wirelessly coupled to network 14 via wirelesscommunication channel 60 established between personal digital assistant42 and cellular network/bridge 62, which is shown directly coupled tonetwork 14.

As is known in the art, all of the IEEE 802.11x specifications may useEthernet protocol and carrier sense multiple access with collisionavoidance (i.e., CSMA/CA) for path sharing. The various 802.11xspecifications may use phase-shift keying (i.e., PSK) modulation orcomplementary code keying (i.e., CCK) modulation, for example. As isknown in the art, Bluetooth is a telecommunications industryspecification that allows e.g., mobile phones, computers, and personaldigital assistants to be interconnected using a short-range wirelessconnection.

Client electronic devices 38, 40, 42, 44 may each execute an operatingsystem, examples of which may include but are not limited to MicrosoftWindows™, Microsoft Windows CE™, Redhat Linux™, or a custom operatingsystem.

Referring also to FIG. 2, storage network 12 may include at least onestorage processor (e.g. storage processor 100), examples of which mayinclude but are not limited the types of storage processors includedwithin the CLARiiON series arrays offered by The EMC Corporation ofHopkinton, Mass. While storage network 12 is shown to include a singlestorage processor (i.e. storage processor 100), this is for illustrativepurposes only and is not intended to be a limitation of this disclosure,as other configurations are possible and are considered to be within thescope of this disclosure. For example, storage network 12 may beconfigured in a high availability fashion and one or more additionalstorage processors storage processors (not shown) may be included withinstorage network 12. In the event that storage network 12 includes aplurality of storage processors, each storage processor may beconfigured as a hot-swappable field replaceable unit (FRU).

Storage processor 100 may be configured to allow for front-endconnectivity to “hosts”. Examples of such hosts may include but are notlimited to the various computers, servers, and client electronic devicesthat are connected to e.g. networks 14, 18. A specific example of a“host” is a computer (e.g., computer 38) that is executing a databaseapplication in which the database application is configured to store thedatabase information on storage network 12. Additionally, storageprocessor 100 may be configured to allow for back-end connectivity tovarious disk arrays, which will be discussed below in greater detail.

The storage processors (e.g. storage processor 100) included withinstorage network 12 may include cache memory (not shown) that may besegmented into read cache memory (not shown) and write cache memory (notshown). Read cache memory may be used for staging/prefetching data forfilling data read requests received from a host and write cache memorymay be used to accelerate data write request received from a host.

Storage network 12 may further include a plurality of storage devicesD_(1-n) (e.g. storage devices 102, 104, 106, 108). Storage devices 102,104, 106, 108 may be configured to provide various levels of performanceand/or high availability. For example, one or more of storage devices102, 104, 106, 108 may be configured as a RAID 0 array, in which data isstriped across storage devices. By striping data across a plurality ofstorage devices, improved performance may be realized. However, RAID 0arrays do not provide a level of high availability.Additionally/alternatively, one or more of storage devices 102, 104,106, 108 may be configured as a RAID 1 array, in which data is mirroredbetween storage devices. By mirroring data between storage devices, alevel of high availability is achieved as multiple copies of the dataare stored within storage network 12.

While in this particular example, storage network 12 is shown to includefour storage devices (e.g. storage devices 102, 104, 106, 108), this isfor illustrative purposes only and is not intended to be a limitation ofthis disclosure. Specifically, the actual number of storage devices maybe increased or decreased depending upon e.g. the level ofredundancy/performance/capacity required.

Storage network 12 may also include one or more coded targets 110. As isknown in the art, a coded target may be used to store coded data thatmay allow for the regeneration of data lost/corrupted on one or more ofstorage devices 102, 104, 106, 108. An example of such a coded targetmay include but is not limited to a hard disk drive that is used tostore parity data within a RAID array.

While in this particular example, storage network 12 is shown to includeone coded target (e.g., coded target 110), this is for illustrativepurposes only and is not intended to be a limitation of this disclosure.Specifically, the actual number of coded targets may be increased ordecreased depending upon e.g. the level ofredundancy/performance/capacity required.

A combination of storage devices 102, 104, 106, 108 and coded target 110may form non-volatile, memory system 112. Examples of storage devices102, 104, 106, 108 and coded target 110 included within non-volatile,memory system 112 may include but are not limited to a plurality ofelectromechanical hard disk drives and/or a plurality of solid-stateflash disk drives.

The manner in which storage network 12 is implemented may vary dependingupon e.g. the level of redundancy/performance/capacity required. Forexample, storage network 12 may be a RAID device in which storageprocessor 100 is a RAID controller card and storage devices 102, 104,106, 108 and/or coded target 110 are individual “hot-swappable” harddisk drives. An example of such a RAID device may include but is notlimited to an NAS device. Alternatively, storage network 12 may beconfigured as a SAN, in which storage processor 100 may be a dedicateddevice (e.g., a CLARiiON storage processor) and each of storage devices102, 104, 106, 108 and/or coded target 110 may be a RAID device.

The various components of storage network 12 (e.g. storage processor100, storage devices 102, 104, 106, 108, and coded target 110) may becoupled using network infrastructure 114, examples of which may includebut are not limited to an Ethernet (e.g., Layer 2 or Layer 3) network, afiber channel network, an InfiniBand network, or any other circuitswitched/packet switched network.

The I/O Scheduling Process:

Storage processor 100 may execute all or a portion of I/O schedulingprocess 10. Additionally, one or more of storage devices 102, 104, 106,108 and/or coded target 110 may execute all or a portion of I/Oscheduling process 10. Further, one or more of client electronic devices38, 40, 42, 44 may execute all or a portion of I/O scheduling process10. For example, I/O scheduling process 10 may be a multi-componentprocess that includes e.g., a storage-processor-based component (notshown), a target-based component (not shown), and aclient-electronic-device component (not shown).

For example and for illustrative purposes, the storage-processor-basedcomponent of I/O scheduling process 10 may be executed on storageprocessor 100. Further and for illustrative purposes, the target-basedcomponent of I/O scheduling process 10 may be executed on each ofstorage devices 102, 104, 106, 108 and/or coded target 110. Furtherstill and for illustrative purposes, the client-electronic-devicecomponent of I/O scheduling process 10 may be executed on one or more ofclient electronic devices 38, 40, 42, 44. Accordingly, thestorage-processor-based component of I/O scheduling process 10, thetarget-based component(s) of I/O scheduling process 10, and theclient-electronic-device component of I/O scheduling process 10 maycooperatively operate to effectuate all of the functionality of I/Oscheduling process 10.

The instruction sets and subroutines of the storage-processor-basedcomponent of I/O scheduling process 10, which may be stored on a storagedevice (e.g., storage device 16) coupled to storage processor 100, maybe executed by one or more processors (not shown) and one or more memoryarchitectures (not shown) included within storage processor 100. Storagedevice 16 may include but is not limited to: a hard disk drive; a tapedrive; an optical drive; a RAID device; a random access memory (RAM);and a read-only memory (ROM).

The instruction sets and subroutines of the target-based component(s) ofI/O scheduling process 10, which may be stored on a storage device (notshown) coupled to e.g., each of storage devices 102, 104, 106, 108and/or coded target 110 may be executed by one or more processors (notshown) and one or more memory architectures (not shown) included withineach of storage devices 102, 104, 106, 108 and/or coded target 110. Thestorage device (not shown) may include but is not limited to: a harddisk drive; a tape drive; an optical drive; a RAID device; a randomaccess memory (RAM); and a read-only memory (ROM).

The instruction sets and subroutines of the client-electronic-devicecomponent of I/O scheduling process 10, which may be stored on a storagedevice coupled to the client electronic device, may be executed by oneor more processors (not shown) and one or more memory architectures (notshown) included within the client electronic device. The storage devicecoupled to the client electronic device may include but is not limitedto: a hard disk drive; a tape drive; an optical drive; a RAID device; arandom access memory (RAM); and a read-only memory (ROM).

Referring also to FIGS. 3 & 4 and as discussed above, I/O schedulingprocess 10 may associate 200 a first I/O scheduling queue (e.g., firstI/O scheduling queue 300) with a first process (e.g., first process 302)that is accessing data stored within storage network 12. The first I/Oscheduling queue (e.g., first I/O scheduling queue 300) may beconfigured to receive 202 a plurality of first process I/O requests(e.g., first process I/O requests 304).

For example, assume that first process 302 is a database process runningon computer 38 that is continuously accessing data stored within storagedevices 102, 104, 106, 108 and/or coded target 110. Accordingly, firstprocess I/O requests 304 may include the various data read requests anddata write requests that are generated by first process 302 while theuser of the database program repeatedly reads database records fromstorage devices 102, 104, 106, 108 and writes revised database recordsto storage devices 102, 104, 106, 108.

I/O scheduling process 10 may associate 206 a second I/O schedulingqueue (e.g., second I/O scheduling queue 308) with a second process(e.g., second process 310) that is accessing data stored within storagenetwork 12. The second I/O scheduling queue (e.g., second I/O schedulingqueue 308) may be configured to receive 208 a plurality of secondprocess I/O requests (e.g., second process I/O requests 312).

For example, assume that second process 310 is a spreadsheet processrunning on computer 38 that is continuously accessing data stored withinstorage devices 102, 104, 106, 108 and/or coded target 110. Accordingly,second process I/O requests 312 may include the various data readrequests and data write requests that are generated by second process310 while the user of the spreadsheet program repeatedly reads datacells from storage devices 102, 104, 106, 108 and writes revised datacells to storage devices 102, 104, 106, 108.

While the system as discussed above as including two I/O schedulingqueues, this is for illustrative purposes only and is not intended to bea limitation of this disclosure. Accordingly, I/O scheduling process 10may be configured to define and associate an I/O scheduling queue foreach process accessing storage network 12. For example, if one-hundredprocesses access storage network 12, I/O scheduling process 10 maydefine and associate a unique I/O scheduling queue for each of theseprocesses. Accordingly, I/O scheduling process 10 may increase (ordecrease) the quantity of I/O scheduling queue based upon the number ofprocesses accessing storage network 12.

Accordingly, I/O scheduling process 10 may associate an additional I/Oscheduling queue (e.g., I/O scheduling queue 316) with each additionalprocess (e.g., process 318) that is accessing data stored within storagenetwork 12. The additional I/O scheduling queue (e.g., I/O schedulingqueue 316) may be configured to receive a plurality of process I/Orequests (e.g., process I/O requests 320) associated with e.g., process318.

In order to enhance efficiency, I/O scheduling process 10 may obtainstatus information concerning the manner in which storage network 12 isprocessing the various I/O requests that are being provided from e.g.,scheduling queues 300, 308, 316 to storage network 12.

For example, I/O scheduling process 10 may obtain first statusinformation 324 (concerning the manner in which storage network 12 isprocessing first process I/O requests 304), which may be provided to andreceived 212 on first I/O scheduling queue 300.

Further, I/O scheduling process 10 may obtain second status information326 (concerning the manner in which storage network 12 is processingsecond process I/O requests 312), which may be provided to and received214 on second I/O scheduling queue 308.

Additionally, I/O scheduling process 10 may obtain additional statusinformation 328 (concerning the manner in which storage network 12 isprocessing additional process I/O requests 320), which may be providedto and received on additional I/O scheduling queue 316.

Status information 324, 326, 328 may include various pieces of dataconcerning the manner in which storage network 12 is processing the I/Orequests that were provided to it. Examples of such information mayinclude the total quantity (e.g. in megabytes) of I/O requests includedwithin the corresponding queues of storage network 12. For example,there are currently 16 MB of unprocessed I/O requests within storagenetwork 12.

Additionally/alternatively, the information may define the total numberof I/O requests included within the corresponding queues of storagenetwork 12. For example, there are currently 32 unprocessed I/O requestswithin storage network 12.

Additionally/alternatively, the information may define the anticipatedlatency of the corresponding queues of storage network 12. For example,the I/O requests are taking approximately 30 ms each to process andthere are 16 I/O requests currently queued up within storage network 12.Accordingly, it will most likely take 480 ms to process the I/O requestscurrently included within storage network 12.

Once such status information (e.g. status information 324, 326) isreceived 212, 214 by the appropriate I/O scheduling queue (e.g. I/Oscheduling queue 300, 308), the rate at which I/O requests are providedto storage network 12 may be regulated.

For example, I/O scheduling process 10 may regulate 216 the rate atwhich first I/O scheduling queue 300 provides first process I/O requests304 to storage network 12 in response to first status information 324.

Further, I/O scheduling process 10 may regulate 218 the rate at whichsecond I/O scheduling queue 308 provides second process I/O requests 312to storage network 12 in response to second status information 326.

Additionally, I/O scheduling process 10 may regulate the rate at whichadditional I/O scheduling queue 316 provides additional process I/Orequests 320 to storage network 12 in response to additional statusinformation 328.

Accordingly, in the event that storage network 12 is becoming overlybacked up, I/O scheduling process 10 may reduce the rate at which thevarious I/O requests are being provided to storage network 12.

In order to increase the efficiency of the handling of the I/O requests,the various I/O scheduling queue may try to combine multiple smaller I/Orequest into a single, larger I/O request. For example, in the eventthat a first I/O request is writing data to a first logical disk and asecond I/O request is reading data from a second logical disk, thesedisparate I/O requests may typically not be combined. However, in theevent that e.g. a first I/O request is writing data to a first logicaldisk and a second I/O request is writing data to the same logical disk,depending upon the specific portions of the disk to which the data isbeing written, it may be possible to combine these two I/O requests toform a single larger I/O request.

For example, I/O scheduling process 10 may combine 220 two or more offirst process I/O requests 304 to form a combined first process I/Orequest (e.g. combined first process I/O requests 330, 332), which standin contrast to those I/O requests that could not be combined (e.g. firstprocess I/O requests 334, 336). I/O scheduling process 10 may providethe combined first process I/O request (e.g. combined first process I/Orequests 330, 332) to storage network 12.

Further, I/O scheduling process 10 may combine 224 two or more of secondprocess I/O requests 312 to form a combined second process I/O request(e.g. combined second process I/O requests 338, 340), which stand incontrast to those I/O requests that could not be combined (e.g. secondprocess I/O requests 342, 344). I/O scheduling process 10 may providethe combined second process I/O request (e.g. combined second processI/O requests 338, 340) to storage network 12.

Additionally, I/O scheduling process 10 may combine two or more ofadditional process I/O requests 320 to form a combined additionalprocess I/O request (e.g. combined additional process I/O requests 346,348), which stand in contrast to those I/O requests that could not becombined (e.g. additional process I/O requests 350, 352). I/O schedulingprocess 10 may provide the combined additional process I/O request (e.g.combined second process I/O requests 346, 348) to storage network 12.

Accordingly, by combining 220, 224 discrete I/O requests into largercombined I/O requests, the number of write operations and/or readoperations that need to be performed by storage network 12 may bereduced, thus increasing the efficiency of the same. Additionally, asI/O scheduling process 10 is aware (via status information 324, 326,328) of the status of storage network 12, in the event that a particularqueue within storage network 12 is “backlogged” with a substantialnumber of pending I/O requests, I/O scheduling process 10 may takeadditional time to try to combine smaller I/O requests into larger I/Orequests for the particular queue that is currently “backlogged”.Alternatively, if I/O scheduling process 10 (via status information 324,326, 328) is aware that a particular queue within storage network 12 isrunning out of pending I/O requests, I/O scheduling process 10 may startpassing uncombined (and smaller) I/O request to the particular queuethat is currently running out of pending I/O requests, so the same maybe processed.

As will be appreciated by one skilled in the art, the present disclosuremay be embodied as a method, system, or computer program product.Accordingly, the present disclosure may take the form of an entirelyhardware embodiment, an entirely software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system.” Furthermore,the present disclosure may take the form of a computer program producton a computer-usable storage medium having computer-usable program codeembodied in the medium.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present disclosure. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the disclosure.As used herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present disclosure has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the disclosure in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the disclosure. Theembodiment was chosen and described in order to best explain theprinciples of the disclosure and the practical application, and toenable others of ordinary skill in the art to understand the disclosurefor various embodiments with various modifications as are suited to theparticular use contemplated.

Having thus described the disclosure of the present application indetail and by reference to embodiments thereof, it will be apparent thatmodifications and variations are possible without departing from thescope of the disclosure defined in the appended claims.

What is claimed is:
 1. A method comprising: associating, via one or more computing devices, a first input/output (I/O) scheduling queue with a first process accessing a storage network, wherein the first I/O scheduling queue is configured to receive a plurality of first process I/O requests; associating, via the one or more computing devices, a second I/O scheduling queue with a second process accessing the storage network, wherein the second I/O scheduling queue is distinct from the first I/O scheduling queue, wherein the second I/O scheduling queue is configured to receive a plurality of second process I/O requests that are distinct from the plurality of first process I/O requests; regulating, via the one or more computing devices, a rate at which the first I/O scheduling queue provides the plurality of first process I/O requests to the storage network; and combining, via the one or more computing devices, two or more of the plurality of first process I/O requests to form a combined first process I/O request, wherein one or more of: a number of necessary read operations associated with the first scheduling queue is reduced and a number of necessary write operations associated with the first scheduling queue is reduced.
 2. The method of claim 1 further comprising: receiving first status information concerning the first I/O scheduling queue.
 3. The method of claim 2 wherein the first status information includes one or more of the total size of all I/O requests included within the first I/O scheduling queue, the total number of I/O requests included within the first I/O scheduling queue, and the anticipated latency of the first I/O scheduling queue.
 4. The method of claim 1 further comprising: receiving second status information concerning the second I/O scheduling queue.
 5. The method of claim 1 further comprising: regulating a rate at which the second I/O scheduling queue provides the plurality of second process I/O requests to the storage network.
 6. The method of claim 1 further comprising: combining two or more of the plurality of second process I/O requests to form a combined second process I/O request.
 7. The method of claim 1 wherein the second process accessing the storage network is a different type of process than the first process accessing the storage network.
 8. A computer program product residing on a non-transitory computer readable medium having a plurality of instructions stored thereon which, when executed by a processor, cause the processor to perform operations comprising: associating a first input/output (I/O) scheduling queue with a first process accessing a storage network, wherein the first I/O scheduling queue is configured to receive a plurality of first process I/O requests; associating a second I/O scheduling queue with a second process accessing the storage network, wherein the second I/O scheduling queue is distinct from the first I/O scheduling queue, wherein the second I/O scheduling queue is configured to receive a plurality of second process I/O requests that are distinct from the plurality of first process I/O requests; regulating a rate at which the first I/O scheduling queue provides the plurality of first process I/O requests to the storage network; and combining two or more of the plurality of first process I/O requests to form a combined first process I/O request, wherein one or more of: a number of necessary read operations associated with the first scheduling queue is reduced and a number of necessary write operations associated with the first scheduling queue is reduced.
 9. The computer program product of claim 8 further comprising instructions for: receiving first status information concerning the first I/O scheduling queue.
 10. The computer program product of claim 9 wherein the first status information includes one or more of the total size of all I/O requests included within the first I/O scheduling queue, the total number of I/O requests included within the first I/O scheduling queue, and the anticipated latency of the first I/O scheduling queue.
 11. The computer program product of claim 8 further comprising instructions for: receiving second status information concerning the second I/O scheduling queue.
 12. The computer program product of claim 8 further comprising instructions for: regulating a rate at which the second I/O scheduling queue provides the plurality of second process I/O requests to the storage network.
 13. The computer program product of claim 8 further comprising instructions for: combining two or more of the plurality of second process I/O requests to form a combined second process I/O request.
 14. The computer program product of claim 8 wherein the second process accessing the storage network is a different type of process than the first process accessing the storage network.
 15. A computing system comprising: at least one processor; at least one memory architecture coupled with the at least one processor; a first software module executed on the at least one processor and the at least one memory architecture, wherein the first software module is configured to perform operations including associating a first input/output (I/O) scheduling queue with a first process accessing a storage network, wherein the first I/O scheduling queue is configured to receive a plurality of first process I/O requests; a second software module executed on the at least one processor and the at least one memory architecture, wherein the second software module is configured to perform operations including associating a second I/O scheduling queue with a second process accessing the storage network, wherein the second I/O scheduling queue is distinct from the first I/O scheduling queue, wherein the second I/O scheduling queue is configured to receive a plurality of second process I/O requests that are distinct from the plurality of first process I/O requests; a third software module executed on the at least one processor and the at least one memory architecture, wherein the third software module is configured to perform operations including regulating a rate at which the first I/O scheduling queue provides the plurality of first process I/O requests to the storage network; and a fourth software module executed on the at least one processor and the at least one memory architecture, wherein the fourth software module is configured to perform operations including combining two or more of the plurality of first process I/O requests to form a combined first process I/O request, wherein one or more of: a number of necessary read operations associated with the first scheduling queue is reduced and a number of necessary write operations associated with the first scheduling queue is reduced.
 16. The computing system of claim 15 further comprising a fifth software module executed on the at least one processor and the at least one memory architecture, wherein the fifth software module is configured to perform operations including: receiving first status information concerning the first I/O scheduling queue.
 17. The computing system of claim 16 wherein the first status information includes one or more of the total size of all I/O requests included within the first I/O scheduling queue, the total number of I/O requests included within the first I/O scheduling queue, and the anticipated latency of the first I/O scheduling queue.
 18. The computing system of claim 15 further comprising a sixth software module executed on the at least one processor and the at least one memory architecture, wherein the sixth software module is configured to perform operations including: receiving second status information concerning the second I/O scheduling queue.
 19. The computing system of claim 15 further comprising a seventh software module executed on the at least one processor and the at least one memory architecture, wherein the seventh software module is configured to perform operations including: regulating a rate at which the second I/O scheduling queue provides the plurality of second process I/O requests to the storage network.
 20. The computing system of claim 15 further comprising a eighth software module executed on the at least one processor and the at least one memory architecture, wherein the eighth software module is configured to perform operations including: combining two or more of the plurality of second process I/O requests to form a combined second process I/O request.
 21. The computing system of claim 15 wherein the second process accessing the storage network is a different type of process than the first process accessing the storage network. 